Max-planck-institut F Ur Informatik Termination Orderings for Rippling K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses Publication Notes
نویسندگان
چکیده
Rippling is a special type of rewriting developed for inductive theorem proving Bundy et al have shown that rippling terminates by providing a well founded order for the annotated rewrite rules used by rippling Here we simplify and generalize this order thereby enlarging the class of rewrite rules that can be used In addition we extend the power of rippling by proposing new domain dependent orders These extensions elegantly combine rippling with more conventional term rewriting Such combinations o er the exibility and uniformity of conventional rewriting with the highly goal di rected nature of rippling Finally we show how our orders simplify implementation of provers based on rippling
منابع مشابه
Max-planck-institut F Ur Informatik Middle-out Reasoning for Logic Program Synthesis K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses
Logic programs can be synthesized as a by-product of the planning of their veri cation proofs. This is achieved by using higher-order variables at the proof planning level, which become instantiated in the course of planning. We illustrate two uses of such variables in proof planning for program synthesis, one for synthesis proper and one for the selection of induction schemes. We demonstrate t...
متن کاملMax-planck-institut F Ur Informatik a Recursion Planning Analysis of Inductive Completion K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses Publication Notes
We use the AI proof planning techniques of recursion analysis and rippling as tools to analyze so called inductionless induction proof techniques. Recursion analysis chooses induction schemas and variables and rippling controls rewriting in explicit induction proofs. They provide a basis for explaining the success and failure of inductionless induction both in deduction of critical pairs and in...
متن کاملMax-planck-institut F Ur Informatik Set Constraints Are the Monadic Class K I N F O R M a T I K Im Stadtwald W 6600 Saarbr Ucken Germany Authors' Addresses
We investigate the relationship between set constraints and the monadic class of rst-order formulas and show that set constraints are essentially equivalent to the monadic class. From this equivalence we can infer that the satis ability problem for set constraints is complete for NEXPTIME. More precisely, we prove that this problem has a lower bound of NTIME(cn= logn). The relationship between ...
متن کاملMax-planck-institut F Ur Informatik Ordered Semantic Hyper-linking K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses
We propose a method for combining the clause linking theorem proving method with theorem proving methods based on orderings This may be useful for incorporating term rewriting based approaches into clause linking In this way some of the proposi tional ine ciencies of ordering based approaches may be overcome while at the same time incorporating the advantages of ordering methods into clause lin...
متن کاملMax-planck-institut F Ur Informatik an Abstract Program Generation Logic K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses
We present a system for representing programs as proofs which combines features of classical and constructive logic We present the syntax semantics and inference rules of the system and establish soundness and consistency The system is based on an unspeci ed underlying logic possessing certain properties We show how proofs in this system can be systematically converted to programs in a class of...
متن کامل